Search results for "Computational logic"

showing 3 items of 3 documents

Mathematical logic and quantum finite state automata

2009

AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state automata in respect to the language recognition and acceptance probability of quantum finite-state automata. As is well known, logic has had a great impact on classical computation, it is promising to study the relation between quantum finite-state automata and mathematical logic. After a brief introduction to the connection between classical computation and logic, the required background of the logic and quantum finite-state automata is provided and the results of the connection between quantum finite-state automata and logic are presented.

General Computer ScienceMeasure-many quantum finite-state automataComputational logicMultimodal logicQuantum dot cellular automatonIntermediate logicMeasure-once quantum finite-state automataNonlinear Sciences::Cellular Automata and Lattice GasesTheoretical Computer ScienceAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESModular logicComputerSystemsOrganization_MISCELLANEOUSComputer Science::Logic in Computer ScienceQuantum finite automataDynamic logic (modal logic)Automata theoryQuantum finite-state automataFirst-order logicAlgorithmComputer Science::Formal Languages and Automata TheoryMathematicsQuantum cellular automatonComputer Science(all)Theoretical Computer Science
researchProduct

Logic, Computing and Biology

2015

Logic and Computing are appropriate formal languages for Biology, and we may well be surprised by the strong analogy between software and DNA, and between hardware and the protein machinery of the cell. This chapter examines to what extent any biological entity can be described by an algorithm and, therefore, whether the Turing machine and the halting problem concepts apply. Last of all, I introduce the concepts of recursion and algorithmic complexity, both from the field of computer science, which can help us understand and conceptualise biological complexity.

Turing machinesymbols.namesakeRecursionTheoretical computer scienceComputer scienceComputational logicFormal languagesymbolsAnalogyComputerApplications_COMPUTERSINOTHERSYSTEMSGödel's incompleteness theoremsUnconventional computingHalting problem
researchProduct

The Syllogistic with Unity

2011

We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.

logic and natural languageFOS: Computer and information sciencesPure mathematicsComputer Science - Logic in Computer Sciencecomputational complexityComputational complexity theoryComputational logicSyllogismMathematics - Logicproof theorysyllogismsDerivation relationLogic in Computer Science (cs.LO)Reductio ad absurdumPhilosophyPhilosophy of logicProof theoryCalculusFOS: MathematicsF.4.0Logic (math.LO)Finite setMathematics03B65
researchProduct